Sensitivity Analysis of Road Network by Mathematical Programming based on Cut Matrix and OD-cut Matrix
نویسندگان
چکیده
منابع مشابه
On the Matrix-Cut Rank of Polyhedra
Lovász and Schrijver (1991) described a semi-definite operator for generating strong valid inequalities for the 0-1 vectors in a prescribed polyhedron. Among their results, they showed that n iterations of the operator are sufficient to generate the convex hull of 0-1 vectors contained in a polyhedron in n-space. We give a simple example, having Chvátal rank 1, that meets this worst case bound ...
متن کاملLoop equations for multi - cut matrix models
The loop equation for the complex one-matrix model with a multi-cut structure is derived and solved in the planar limit. An iterative scheme for higher genus contributions to the free energy and the multi-loop correlators is presented for the two-cut model, where explicit results are given up to and including genus two. The double-scaling limit is analyzed and the relation to the one-cut soluti...
متن کاملAlfa-cut based linear programming methodology for constrained matrix games with payoffs of trapezoidal fuzzy numbers
The purpose of this paper is to develop an effective methodology for solving constrained matrix games with payoffs of trapezoidal fuzzy numbers (TrFNs), which are a type of two-person non-cooperative games with payoffs expressed by TrFNs and players’ strategies being constrained. In this methodology, it is proven that any Alfa-constrained matrix game has an interval-type value and hereby any co...
متن کاملStrong-Cut Enumerative procedure for Extreme point Mathematical Programming Problems
subject to A X = b and that,X is an extreme point of DX=d, X>O, is developed. The procedure will avoid the investigation of many of the extreme points of DX = d, X > 0 and also alternative optimas of different best extreme points of DX = d, X >_ 0 will not be needed. The algorithm is expected to work very efficiently. Zusammenfassung: In dieser Arbeit "Strong-Cut Enumerative Procedure for Extre...
متن کاملBranch-and-cut Algorithms for Integer Programming, Branch-and-cut
Branch-and-cut methods are exact algorithms for integer programming problems. They consist of a combination of a cutting plane method with a branch-and-bound algorithm. These methods work by solving a sequence of linear programming relaxations of the integer programming problem. Cutting plane methods improve the relaxation of the problem to more closely approximate the integer programming probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: INFRASTRUCTURE PLANNING REVIEW
سال: 1996
ISSN: 0913-4034,1884-8303
DOI: 10.2208/journalip.13.633